MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL
نویسندگان
چکیده
In the context of a variation of the standard UFL (Uncapacitated Facility Location) problem, but with an objective function that is a separable convex quadratic function of the transportation costs, we present some techniques for improving relaxations of MINLP formulations. We use a disaggregation principal and a strategy of developing model-specific valid inequalities (some nonlinear), which enable us to significantly improve the quality of the NLP (Nonlinear Programming) relaxation of our MINLP model. Additionally, we describe some directions in which our methodology can be extended. Keyword(s): facility location, mixed integer nonlinear programming, outer approximation
منابع مشابه
Linear Time Algorithms for Some Separable Quadratic Programming Problems
A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints
متن کاملRedesigning Benders Decomposition for Large-Scale Facility Location
The Uncapacitated Facility Location (UFL) problem is one of the most famous and most studied problems in the Operations Research literature. Given a set of potential facility locations, and a set of customers, the goal is to find a subset of facility locations to open, and to allocate each customer to open facilities, so that the facility opening plus customer allocation costs are minimized. In...
متن کاملA strong conic quadratic reformulation for machine-job assignment with controllable processing times
Wedescribe a polynomial-size conic quadratic reformulation for amachine-job assignment problemwith separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation. © 2009 Elsevier B.V. All rights reserved.
متن کاملPerspective Relaxation of Minlps with Indicator Variables
We study mixed integer nonlinear programs (MINLP) that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables. An indicator variable, when it is “turned off”, forces some of the decision variables to assume a fixed value, and, when it is “turned on”, forces them to belong to a convex set. Most of the integer variables in known...
متن کاملPerspective reformulations of mixed integer nonlinear programs with indicator variables
We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables. An indicator variable, when it is “turned off”, forces some of the decision variables to assume fixed values, and, when it is “turned on”, forces them to belong to a convex set. Many practical MINLPs contain integer ...
متن کامل